Extended Well-posedness of Vector Optimization Problems: The Convex Case

Well-posedness for Lexicographic Vector Equilibrium Problems

We consider lexicographic vector equilibrium problems in metric spaces. Sufficient conditions for a family of such problems to be (uniquely) well-posed at the reference point are established. As an application, we derive several results on well-posedness for a class of variational inequalities.

On well-posedness in vector optimization

Well-posedness and convexity in vector optimization

Well-posedness and scalarization in vector optimization

In this paper we study several existing notions of well-posedness for vector optimization problems. We distinguish them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are ...

Well-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems

We focus on some convex separable optimization problems, considered by the author in previous papers, for which problems, necessary and sufficient conditions or sufficient conditions have been proved, and convergent algorithms of polynomial computational complexity have been proposed for solving these problems.The concepts ofwell-posedness of optimization problems in the sense of Tychonov, Hada...